Ant Colony System for Dynamic Vehicle Routing Problem with Overtime
نویسندگان
چکیده
منابع مشابه
Ant Colony System for a Dynamic Vehicle Routing Problem
An aboundant literature on vehicle routing problems is available. However, most of the work deals with static problems, where all data are known in advance, i.e. before the optimization has started. The technological advances of the last few years give rise to a new class of problems, namely the dynamic vehicle routing problems, where new orders are received as time progresses and must be dynam...
متن کاملTime Dependent Vehicle Routing Problem with an Ant Colony System
IDSIA-02-03 Abstract The Time Dependent Vehicle Routing Problem, TDVRP, consists in optimally routing a fleet of vehicles of fixed capacity when the traveling times are dependent on time, that is, the time of the day when the trip on a leg was initiated. The delivery to a customer must also satisfy the customer’s delivery time window. The optimization consists in finding the solution that minim...
متن کاملAn ant colony system for responsive dynamic vehicle routing
M. Schyns ∗ Abstract. We present an algorithm based on an Ant Colony System to deal with a broad range of Dynamic Capacitated Vehicle Routing Problems with Time Windows, (partial) Split Delivery and Heterogeneous fleets (DVRPTWSD). We address the important case of responsiveness. Responsiveness is defined here as completing a delivery as soon as possible, within the time window, such that the c...
متن کاملSolving the Vehicle Routing Problem with Simultaneous Pickup and Delivery by an Effective Ant Colony Optimization
One of the most important extensions of the capacitated vehicle routing problem (CVRP) is the vehicle routing problem with simultaneous pickup and delivery (VRPSPD) where customers require simultaneous delivery and pick-up service. In this paper, we propose an effective ant colony optimization (EACO) which includes insert, swap and 2-Opt moves for solving VRPSPD that is different with common an...
متن کاملAnt Colony Algorithm for the Single Loop Routing Problem
In this paper, a new algorithm for solving the single loop routing problem is presented. The purpose of the single loop routing problem(SLRP) is to find the shortest loop for an automated guided vehicle covering at least one edge of each department of a block layout. First it shown that this problem can be represented as a graph model. Then a meta-heuristic algorithm based on and colony system ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Advanced Computer Science and Applications
سال: 2018
ISSN: 2156-5570,2158-107X
DOI: 10.14569/ijacsa.2018.090644